A Neural Networks Algorithm for the Minimum Coloring Problem Using FPGAs
نویسنده
چکیده
This paper presents a hardware implementation to solve the graph coloring problem (chromatic number ) for arbitrary graphs using the hopfield neural network model of computation. The graph coloring problem, an NP-hard problem, has important applications in many areas including time tabling and scheduling, frequency assignment, and register allocation. The proposed algorithm has a time complexity of for a neural network with vertices and colors. The algorithm was implemented using VHDL and downloaded on a Field Programmable Gate Array (FPGA) device. The algorithm was simulated and tested on various graphs, all yielding optimum solutions.
منابع مشابه
Optimizing Multiple Response Problem Using Artificial Neural Networks and Genetic Algorithm
This paper proposes a new intelligent approach for solving multi-response statistical optimization problems. In most real world optimization problems, we are encountered adjusting process variables to achieve optimal levels of output variables (response variables). Usual optimization methods often begin with estimating the relation function between the response variable and the control variab...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملEnergy function-based approaches to graph coloring
We describe an approach to optimization based on a multiple-restart quasi-Hopfield network where the only problem-specific knowledge is embedded in the energy function that the algorithm tries to minimize. We apply this method to three different variants of the graph coloring problem: the minimum coloring problem, the spanning subgraph k-coloring problem, and the induced subgraph k-coloring pro...
متن کاملOptimum Design of Liquified Natural Gas Bi-lobe Tanks using Finite Element, Genetic Algorithm and Neural Network
A comprehensive set of ten artificial neural networks is developed to suggest optimal dimensions of type ‘C’ Bi-lobe tanks used in the shipping of liquefied natural gas. Multi-objective optimization technique considering the maximum capacity and minimum cost of vessels are implemented for determining optimum vessel dimensions. Generated populations from a genet...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کامل